std::queue::front

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::queue
Member functions queue::queue queue::~queue queue::operator= Element access queue::front queue::back Capacity queue::empty queue::size Modifiers queue::push queue::emplace queue::pop queue::swap

reference front();
const_reference front() const;

Returns reference to the first element in the queue. This element will be the first element to be removed on a call to pop(). Effectively calls c.front().

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

(none)

[edit] Return value

reference to the first element

[edit] Complexity

constant

[edit] See also

back	access the last element (public member function)
pop	removes the first element (public member function)